| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/w5vee |
| Repository | sid.inpe.br/banon/2002/11.06.12.18 |
| Last Update | 2002:11.06.02.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2002/11.06.12.18.09 |
| Metadata Last Update | 2022:06.14.00.12.10 (UTC) administrator |
| DOI | 10.1109/SIBGRA.2000.883918 |
| Citation Key | FabrisAssiForr:2000:PaFiAl |
| Title | Parallelization of filling algorithms on distributed memory machines using the point containment paradigm  |
| Year | 2000 |
| Access Date | 2024, May 04 |
| Number of Files | 1 |
| Size | 520 KiB |
| 2. Context | |
| Author | 1 Fabris, Antonio Elias 2 Assis, Marcos Machado Ottani 3 Forrest, A. Robin |
| Editor | Carvalho, Paulo Cezar Pinto Walter, Marcelo |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI) |
| Conference Location | Gramado, RS, Brazil |
| Date | 17-20 Oct. 2000 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 235-242 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society |
| History (UTC) | 2008-07-17 14:10:50 :: administrator -> banon :: 2008-08-26 15:23:02 :: banon -> administrator :: 2009-08-13 20:36:58 :: administrator -> banon :: 2010-08-28 20:00:10 :: banon -> administrator :: 2022-06-14 00:12:10 :: administrator -> :: 2000 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | parallel algorithms filling algorithm parallelization distributed memory machines point containment paradigm point containment predicate mathematically well-defined object computer graphics point-driven algorithms parallel configurations point-driven algorithm standard uniprocessor software implementation interactive editing |
| Abstract | The point containment predicate which specifies if a point is part of a mathematically well-defined object is a crucial problem in computer graphics. Point-driven algorithms can be executed for several points in parallel as there is no interdependence among the computations for different points. The paper presents a variety of parallel configurations to counteract the main disadvantage of the point-driven algorithm: its slowness on a standard uniprocessor software implementation for interactive editing and manipulation. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2000 > Parallelization of filling... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Parallelization of filling... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZeBBx/w5vee |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/w5vee |
| Target File | 235-242.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46PN6AP 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/04.27.03.08 5 sid.inpe.br/sibgrapi/2022/06.10.21.49 1 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Gramado, RS, Brazil, from October 17 to 20. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |